منابع مشابه
Branching with Uncertain Semantics
In their paper ‘Branching and Uncertainty’, (Saunders and Wallace [2008]) aim to solve the so-called ‘incoherence problem’ commonly attributed to the Everett interpretation of quantum mechanics (EQM). The Everett interpretation posits a multiplicity of branching universes as a realistic reading of the evolution of the quantum state function. The ‘incoherence problem’ is, roughly, that our commo...
متن کاملTransition Semantics for Branching Time
In this paper we develop a novel propositional semantics based on the framework of branching time. The basic idea is to replace the moment-history pairs employed as parameters of truth in the standard Ockhamist semantics by pairs consisting of a moment and a consistent, downward closed set of so-called transitions. Whereas histories represent complete possible courses of events, sets of transit...
متن کاملScheduling for an Uncertain Future with Branching Constraint Satisfaction Problems
Agents which schedule tasks must deal with problems that change as time progresses, often while the problem is being solved. In this paper, we assume that the agent does not blindly react to events, but uses knowledge of likely changes to make decisions in the present that will facilitate future actions. To solve this problem, we introduce the branching CSP, a new variant of the constraint sati...
متن کاملBootstrapping , uncertain semantics , and invariance
In the problem of bootstrapping, an agent learns to use an unknown body, in an unknown world, starting from zero information about the models involved. This is a fascinating problem, which so far has not been given a proper formalization. In this paper, we give a rigorous definition of what it means for an agent to be able to use “uninterpreted” observations and commands: there are some disturb...
متن کاملLinear Time and Branching Time Semantics for Recursion with Merge
We consider two ways of assigning semantics to a class of statements built from a set of atomic actions (the 'alph.abe:'), by means of sequential composition, nondeterministic choice, recursion and merge (arbitmry interleaving). The first is linear time semantics (LT), stated in terms of trace theory; the semantic domain is the collection of all closed sets of finite and inftnite words. The sec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The British Journal for the Philosophy of Science
سال: 2010
ISSN: 0007-0882,1464-3537
DOI: 10.1093/bjps/axq001